A Sublinear Bound on the Chromatic Zeros of Theta Graphs
نویسنده
چکیده
Let = (m 1 ; : : : ; m k) denote a graph consisting of two vertices u; v and k internally-disjoint uv-paths of lengths m 1 , : : : ,m k. We exhibit an implicitly-deened function R(k) such that every complex zero z of the chromatic polynomial of satisses jz ? 1j < R(k), and show that R(k) is sublinear as k ! 1.
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملChromatic Roots are Dense in the Whole Complex Plane
I show that the zeros of the chromatic polynomials PG(q) for the generalized theta graphs Θ(s,p) are, taken together, dense in the whole complex plane with the possible exception of the disc |q − 1| < 1. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) ZG(q, v) outside the disc |q + v| < |v|. An immediate corollary is that the chr...
متن کاملThe largest non-integer real zero of chromatic polynomials of graphs with fixed order
It is easy to verify that the chromatic polynomial of a graph with order at most 4 has no non-integer real zeros, and there exists only one 5-vertex graph having a non-integer real chromatic root. This paper shows that, for 66 n6 8 and n¿ 9, the largest non-integer real zeros of chromatic polynomials of graphs with order n are n − 4 + =6 − 2= , where = ( 108 + 12 √ 93 )1=3 , and ( n− 1 +√(n− 3)...
متن کاملChromatic Polynomials, Potts Models and All That
The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex zeros of the Potts partition function are of interest both to statistical mechanicians and to combinatorists. I give a pedagogical introduction to all these...
متن کاملChromatic polynomials and their zeros and asymptotic limits for families of graphs
Let P (G, q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and defineW = limn→∞ P (G, q) 1/n. Besides their mathematical interest, these functions are important in statistical physics. We give a comparative discussion of exact calculations of P and W for a variety of recursive families of graphs, including strips of regular lattices with various boundary condition...
متن کامل